normalization transformation — преобразование для просмотра
normalisation transformation — преобразование для просмотра
fast fourier transformation — быстрое преобразование Фурье
angular transformation — тригонометрическое преобразование
medial axis transformation — преобразование срединной оси
The English-Russian dictionary general scientific. 2015.
Hidden transformation — The hidden transformation reformulates a constraint satisfaction problem in such a way all constraints have at most two variables. The new problem is satisfiable if and only if the original problem was, and solutions can be converted easily from… … Wikipedia
Dessin d'enfant — In mathematics, a dessin d enfant (French for a child s drawing , plural dessins d enfants, children s drawings ) is a type of graph drawing used to study Riemann surfaces and to provide combinatorial invariants for the action of the absolute… … Wikipedia
Petri net — A Petri net (also known as a place/transition net or P/T net) is one of several mathematical modeling languages for the description of distributed systems. A Petri net is a directed bipartite graph, in which the nodes represent transitions (i.e.… … Wikipedia
Maximum flow problem — An example of a flow network with a maximum flow. The source is s, and the sink t. The numbers denote flow and capacity. In optimization theory, the maximum flow problem is to find a feasible flow through a single source, single sink flow network … Wikipedia
Permanent is sharp-P-complete — The correct title of this article is Permanent is #P complete. The substitution or omission of the # sign is because of technical restrictions. In a 1979 paper Leslie Valiant proved[1] that the problem of computing the permanent of a matrix is #P … Wikipedia
Maximum cut — A maximum cut. For a graph, a maximum cut is a cut whose size is at least the size of any other cut. The problem of finding a maximum cut in a graph is known as the max cut problem. The problem can be stated simply as follows. One wants a subset… … Wikipedia
Local consistency — In constraint satisfaction, local consistency conditions are properties of constraint satisfaction problems related to the consistency of subsets of variables or constraints. Several such conditions exist, the most known being node consistency,… … Wikipedia
Aptera (Grèce) — 35° 27′ 46″ N 24° 08′ 31″ E / 35.4629, 24.142 … Wikipédia en Français
Europe, history of — Introduction history of European peoples and cultures from prehistoric times to the present. Europe is a more ambiguous term than most geographic expressions. Its etymology is doubtful, as is the physical extent of the area it designates.… … Universalium
Covering space — A covering map satisfies the local triviality condition. Intuitively, such maps locally project a stack of pancakes above an open region, U, onto U. In mathematics, more specifically algebraic topology, a covering map is a continuous surjective… … Wikipedia
France — /frans, frahns/; Fr. /frddahonns/, n. 1. Anatole /ann nann tawl /, (Jacques Anatole Thibault), 1844 1924, French novelist and essayist: Nobel prize 1921. 2. a republic in W Europe. 58,470,421; 212,736 sq. mi. (550,985 sq. km). Cap.: Paris. 3.… … Universalium
